On the Approximation Ratio of the Path Matching Christofides Algorithm
نویسنده
چکیده
Definition The traveling salesman problem (TSP) is the following optimization problem. Given a complete graph G with edge costs, find a Hamiltonian cycle of minimum cost in G. Definition The metric traveling salesman problem (∆-TSP) is the TSP restricted to instances satisfying the triangle inequality Definition The traveling salesman problem (TSP) is the following optimization problem. Given a complete graph G with edge costs, find a Hamiltonian cycle of minimum cost in G. Definition The β-metric traveling salesman problem (∆ β-TSP) is the TSP restricted to instances satisfying the β-triangle inequality Input: A complete, weighted, metric graph. 1: Find a minimum spanning tree T. Let U be the set of odd-degree vertices in T .
منابع مشابه
Eight Fifth Approximation for TSP Paths
We prove the approximation ratio 8/5 for the metric {s, t}-path-TSP problem, and more generally for shortest connected T -joins. The algorithm that achieves this ratio is the simple “Best of Many” version of Christofides’ algorithm (1976), suggested by An, Kleinberg and Shmoys (2012), which consists in determining the best Christofides {s, t}-tour out of those constructed from a family F>0 of t...
متن کاملThe Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio
We give a new, strongly polynomial algorithm and improved analysis of the metric s − t path TSP. The algorithm finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap. A key new idea is the deletion of some edges, where the arising connectivity problems can be solved for a minor extra cost. ...
متن کاملApproximation Algorithms for Geometric Problems
This chapter surveys approximation algorithms for hard geometric problems. The problems we consider typically take inputs that are point sets or polytopes in twoor three-dimensional space, and seek optimal constructions, (which may be trees, paths, or polytopes). We limit attention to problems for which no polynomial-time exact algorithms are known, and concentrate on bounds for worst-case appr...
متن کاملEight-Fifth Approximation for the Path TSP
We prove the approximation ratio 8/5 for the metric {s, t}-path-TSP problem, and more generally for shortest connected T -joins. The algorithm that achieves this ratio is the simple “Best of Many” version of Christofides’ algorithm (1976), suggested by An, Kleinberg and Shmoys (2012), which consists in determining the best Christofides {s, t}-tour out of those constructed from a family F>0 of t...
متن کاملReassembling trees for the traveling salesman
Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the natural linear programming relaxation can be written as convex combination of spanning trees. The main argument then is that randomly sampling a tree from such a distribution and then completing the tree to a t...
متن کامل